WDM Core Networks : regenerator placement and green networking. (Réseaux de Transport WDM: Planification de Réseaux Translucides et Economie d'Energie)
نویسنده
چکیده
xxi
منابع مشابه
Un cadre graphique et algébrique pour les problèmes de décision incluant incertitudes, faisabilités et utilités
RÉSUMÉ.Dans cet article, nous présentons un cadre générique, graphique et algébrique, permettant de représenter et de manipuler des problèmes de décision séquentielle incluant incertitudes, faisabilités et utilités. Ce cadre, dénommé PFU pour Plausibilités, Faisabilités et Utilités, généralise de nombreux cadres proposés dans le domaine de l’Intelligence Artificielle : problèmes de satisfiabili...
متن کاملActive Networks : Architecture and service distribution
Active networks accelerate network evolution by allowing the network infrastructure to be programmable by the use of “active” packets, in which a traditional packet header is replaced by a program that controls the packet’s action in the network. Recent research in active networking has lead to a “first generation” of active networks technologies with architectures that solved differently key a...
متن کاملTradeoffs when optimizing Lightpaths Reconfiguration in WDM networks
In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The reconfiguration issue arises for instance when it is necessary to improve the usage of resources or when a maintenance operation is planned on a particular link of the network. In order to avoid service interruptions, old lightpaths should not be torn down before the new ones are set up. However, this may...
متن کاملCharacterization of graphs and digraphs with small process number
The process number of a digraph has been introduced as a tool to study rerouting issues in wdm networks. We consider the recognition and the characterization of (di)graphs with process number at most two. Key-words: Rerouting, process number, vertex separation, pathwidth. This work was partially funded by the anr jc Osera, and by European projects ist fet Aeolus and COST 293 Graal. ∗ MASCOTTE, ...
متن کاملOptimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy
This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. The client requests are known beforehand, while the number and location of the servers are to be determined. We investigate the latter problem using the Closest access policy when adding QoS and bandwidth constraints. We propose an optimal algorithm in two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011